Theory of reaction automata: a survey

In this paper, we survey on reaction automata theory to model and analyze the biochemical behaviors of vital reactions occurring in nature. Inspired by two notions a system initiated Ehrenfeucht Rozenberg 2007 multiset, (RAs) have been proposed as computing models for accepting string languages. Given an input sequence symbols, RA performs its computation process follows: at every time receiving symbol, it changes current configuration (represented multiset) applying rules multiset prescribed manner, which kinds application manners are considered: maximally parallel manner (usual) sequential manner. An functions extended finite automaton multisets play role (unbounded number of) states state transition is performed rules. We show that computational powers RAs Turing universal both rule applications. The relationship between space-bounded variants Chomsky hierarchy also discussed. Further, discuss notion chemical automata, simplified variant with free from inhibitor functioning. complete variety related together future research topics.